課程影片與練習
課程簡介
第1週：網路架構與七層參考模式簡介
第2週：IEEE 802.3 乙太網路 (Ethernet)
第3週：IEEE 802.11 無線區域網路 (Wireless LAN)
第4週：IEEE 802.1D 交換機的擴張樹演算法 (Spanning Tree Algorithm)
第5週：IEEE 802.1Q 虛擬區域網路 (Virtual LAN)
第6週：區域網路可靠傳輸技術 －－ 滑動視窗技術
第7週：路由器運作原理以及網路互連技術
※觀看影片請點擊影片名稱後方的"YOUTUBE"或"YOUKU"，
觀看YOUKU影片，請輸入密碼：mooc01004
第8週：TCP 與網路阻塞偵測與控制技術
 |
7.21 Which of the following statements are correct for “Distance Vector” routing protocol ? Assume that each node knows the cost of the link to each of its directly connected neighbors.
下列哪些對於”距離向量”的敘述是正確的 ? 假設每個節點都知道與它直接相連的鄰居之間的鏈結成本
|
| (a)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to all other nodes and distributes that vector to its immediate neighbors. 每個節點建立一個一維陣列(向量)，其包含”距離”(成本)到所有其他節點，並散布給緊鄰的鄰居 | |
| (b)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to all other nodes and distributes that vector to all other nodes. 每個節點建立一個一維陣列(向量)，其包含”距離”(成本)到所有其他節點，並散布給所有其他節點 | |
| (c)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to its immediate neighbors and distributes that vector to all other nodes. 每個節點建立一個一維陣列(向量)，其包含”距離”(成本)到緊鄰的鄰居，並散布給所有其他節點 | |
| (d)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to its immediate neighbors and distributes that vector to its immediate neighbors. 每個節點建立一個一維陣列(向量)，其包含”距離”(成本)到緊鄰的鄰居，並散布給緊鄰的鄰居 | |
| (e)fast response to “good news” and slow response to “bad news” 快速反應好的消息，緩慢反應壞的消息 |
|
7.22 One technique to improve the time to stabilize routing is called “split horizon”. Which of the following statements are correct for “split horizon” ?
一個改善路由表穩定(或收斂)時間的技術為 “水平切割(split horizon)”. 下列哪些對於“水平分割” 的敘述是正確的 ?
|
| (a)When a node sends a routing update to its neighbors, it only sends those routes it learned from each neighbor back to that neighbor. 當一個節點發送一個路由更新訊息給它的鄰居，它只會將由某個鄰居學到的路徑再回送給該鄰居 | |
| (b)When a node sends a routing update to its neighbors, it does not send those routes it learned from each neighbor back to that neighbor 當一個節點發送一個路由更新訊息給它的鄰居，它不將由某個鄰居學到的路徑再回送給該鄰居 | |
| (c)When a node sends a routing update to its neighbors, it sends all routes it learned to those neighbors. 當一個節點發送一個更新訊息給它的鄰居，它會送出所有已經學過的路徑給那些鄰居 | |
| (d)When a node sends a routing update to its neighbors, it sends those routes it learned from each neighbor back to that neighbor with negative information (such as ∞). 當一個節點發送一個更新訊息給它的鄰居，會將由某個鄰居學到的路徑再回送給該鄰居，且該訊息包含負面訊息(譬如無限大) | |
| (e)When a node sends a routing update to its neighbors, it sends all routes it learned to those neighbors with negative information (such as ∞).. 當一個節點發送一個更新訊息給它的鄰居，它會送出所有已經學過的路徑給那些鄰居，訊息包含負面訊息(譬如無限大) |
|
7.23 Which of the following statements are correct for “split horizon with poison reverse” scheme ?
下列哪些對於“水平分割毒藥反向 (split horizon with poison reverse)”的敘述是正確的 ?
|
| (a)When a node sends a routing update to its neighbors, it only sends those routes it learned from each neighbor back to that neighbor. 當一個節點發送一個路由更新訊息給它的鄰居，它只會將由某個鄰居學到的路徑再回送給該鄰居 | |
| (b)When a node sends a routing update to its neighbors, it does not send those routes it learned from each neighbor back to that neighbor 當一個節點發送一個路由更新訊息給它的鄰居，它不將由某個鄰居學到的路徑再回送給該鄰居 | |
| (c)When a node sends a routing update to its neighbors, it sends all routes it learned to those neighbors. 當一個節點發送一個更新訊息給它的鄰居，它會送出所有已經學過的路徑給那些鄰居 | |
| (d)When a node sends a routing update to its neighbors, it sends those routes it learned from each neighbor back to that neighbor with negative information (such as ∞). 當一個節點發送一個更新訊息給它的鄰居，會將由某個鄰居學到的路徑再回送給該鄰居，且該訊息包含負面訊息(譬如無限大) | |
| (e)When a node sends a routing update to its neighbors, it sends all routes it learned to those neighbors with negative information (such as ∞).. 當一個節點發送一個更新訊息給它的鄰居，它會送出所有已經學過的路徑給那些鄰居，訊息包含負面訊息(譬如無限大) |
檔案上傳中...